Comprehensive Gröbner bases and regular rings

Regular Gröbner Bases

In Ufnarovski (1989), the concept of automaton algebras is introduced. These are quotients of the non-commutative polynomial ring where the defining ideal allows some Gröbner basis with a regular set of leading words. However, nothing is reflected concerning the whole structure of the Gröbner basis (except of course for monomial algebras). In this paper we introduce the concept of regular Gröbn...

Comprehensive Gröbner bases and von Neumann regular rings

There is a close relation between comprehensive Gröbner bases and non-parametric Gröbner bases over commutative von Neumann regular rings. By this relation, Gröbner bases over a commutative von Neumann regular ring can be viewed as an alternative to comprehensive Gröbner bases. (Therefore, this Gröbner basis is called an “alternative comprehensive Gröbner basis (ACGB)”.) In the first part of th...

On Gröbner bases in monoid and group rings

Multiplicative Bases, Gröbner Bases, and Right Gröbner Bases

Before surveying the results of the paper, we introduce path algebras. Path algebras play a central role in the representation theory of finite-dimensional algebras (Gabriel, 1980; Auslander et al., 1995; Bardzell, 1997) and the theory of Gröbner bases (Bergman, 1978; Mora, 1986; Farkas et al., 1993) has been an important tool in some results (Feustel et al., 1993; Green and Huang, 1995; Bardze...

Reduced Gröbner Bases in Polynomial Rings over a Polynomial Ring

We define reduced Gröbner bases in polynomial rings over a polynomial ring and introduce an algorithm for computing them. There exist some algorithms for computing Gröbner bases in polynomial rings over a polynomial ring. However, we cannot obtain the reduced Gröbner bases by these algorithms. In this paper we propose a new notion of reduced Gröbner bases in polynomial rings over a polynomial r...